Shortest-weight Paths in Random Graphs Hamed Amini (Swiss Finance Institute) Consider a random regular graph with degree d and of size n. Assign to each edge an i.i.d. exponential random variable with mean one. In the fi

Source URL: web.mat.bham.ac.uk

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact it is strongly

Source URL: zacharyabel.com

Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs ✰, ✰✰ Jiˇr´ı Fialaa , Pavel Klav´ıkb , Jan Kratochv´ıla , and Roman Nedelac

Source URL: iti.mff.cuni.cz

Lecture Notes on Expansion, Sparsest Cut, and Spectral Graph Theory Luca Trevisan University of California, Berkeley

Source URL: www.eecs.berkeley.edu

• Graph theory
• Mathematics
• Algebra
• Algebraic graph theory
• Expander graph
• Adjacency matrix
• Eigenvalues and eigenvectors
• Regular graph
• Spectral graph theory
• Line graph
• Cayley graph
• Graph

On Regular Vertices of the Union of Planar Convex Objects∗ Esther Ezra† J´anos Pach‡ Micha Sharir§

Source URL: www.cims.nyu.edu

• Graph
• Vertex
• Combinatorics
• Polytopes
• Abstract simplicial complex
• Orbifold
• Mathematics
• Geometry
• Symbol

letters to nature typically slower than ,1 km s−1) might differ significantly from what is assumed by current modelling efforts27. The expected equation-of-state differences among small bodies (ice versus rock, for ins

Source URL: static.squarespace.com

• Random graph
• Regular graph
• Neighbourhood
• Topology
• Watts and Strogatz model
• Network science
• Graph theory
• Mathematics
• Graph

CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () Midterm The hypercube graph Qh is an undirected regular graph with 2h vertices, where each vertex corresponds to a binary string of

Source URL: stanford.edu

Regular Expressions with Binding over Data Words for Querying Graph Databases Leonid Libkin1 , Tony Tan2 , and Domagoj Vrgoˇc3 1 2

Source URL: homepages.inf.ed.ac.uk

Querying Regular Graph Patterns ´ , Universidad de Chile PABLO BARCELO LEONID LIBKIN, University of Edinburgh JUAN L. REUTTER, University of Edinburgh and Pontificia Universidad Cat´olica de Chile

Source URL: users.dcc.uchile.cl

ICME QUALIFYING EXAM DISCRETE MATHEMATICS AND ALGORITHMS Let G(V, E) be a connected d-regular graph, v0 ∈ V (G), and assume that at each node, the ends of the edges incident with the node are labelled 1, 2, · · · d.

Source URL: stanford.edu